Expected Heights in Heaps
نویسندگان
چکیده
In this paper several recurrences and formulas are presented leading to an upper bound and a lower bound, both logarithmic, for the expected height of a node in a heap. These bounds are of interest for algorithms that select the kth smallest element in a heap. CR categories: E.1, F.2.2, G.2.1.
منابع مشابه
Verifying Heaps' law using Google Books Ngram data
This article is devoted to the verification of the empirical Heaps law in European languages using Google Books Ngram corpus data. The connection between word distribution frequency and expected dependence of individual word number on text size is analysed in terms of a simple probability model of text generation. It is shown that the Heaps exponent varies significantly within characteristic ti...
متن کاملResolving a Question about Randomized Fibonacci Heaps in the Negative
In this project, we study a randomized variant of Fibonacci heaps where instead of using mark bits, one flips coins in order to determine whether to cascade bringing nodes into the root list. Although it seems intuitive that such heaps should have the same expected performance as standard Fibonacci heaps—and Karger has conjectured as such—the only previous work was an O(log s) upper bound using...
متن کاملReplacing Mark Bits with Randomness in Fibonacci Heaps
A Fibonacci heap is a deterministic data structure implementing a priority queue with optimal amortized asymptotic operation costs. An unaesthetic aspect of Fibonacci heaps is that they must maintain a “mark bit” which serves only to ensure efficiency of heap operations, not their correctness. Karger proposed a simple randomized variant of Fibonacci heaps in which mark bits are replaced by coin...
متن کاملExpected Performance of Dijkstra's Shortest Path Algorithm
We show that the expected number of decrease-key operations in Dijkstra's shortest path algorithm is O(n log(1+m=n)) for an n-vertex, m-arc graph. The bound holds for any graph structure; the only assumption we make is that for every vertex, the lengths of its incoming arcs are drawn independently from the same distribution. The same bound holds with high probability. This result explains the s...
متن کاملEffects of D-Doping on Characteristics of AlAs/GaAs Barriers Grown by Mba at 400 ??C
Effects of d-doping on barriers effective heights and series resistance of highly doped n-type GaAs/AIAs/GaAs/AlAs/GaAs heterostructures, grown by molecular beam epitaxy (MBE) at 400?°C, have been studied. As it was expected, inclusion of an n+ d-doped layer at each hetero-interface has reduced the barriers heights and series resistance of the structure significantly, while p+ d-doped layers ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- BIT
دوره 32 شماره
صفحات -
تاریخ انتشار 1992